A Multiset Semantics for the pi-Calculus with Replication
نویسنده
چکیده
A multiset (or Petri net) semantics is de ned for the calculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics. This paper is readable without knowledge of Petri nets.
منابع مشابه
Multisets and Structural Congruence of the pi-Calculus with Replication
In the -calculus with replication, two processes are multiset congruent if they have the same semantics in the multiset transition system M . It is proved that (extended) structural congruence is the same as multiset congruence, and that it is decidable.
متن کاملStructural inclusion in the pi-calculus with replication
Three notions of structural inclusion between process terms of the-calculus are considered, and proven to be decidable and to have axiom-atizations that are sound and complete in the multiset semantics M of the-calculus. All three are strong simulation relations.
متن کاملThe Logical Meeting Point of Multiset Rewriting and Process Algebra: Progress Report
We present a revisited semantics for multiset rewriting founded on the left sequent rules of linear logic in its LV presentation. The resulting interpretation is extended with a majority of linear connectives into the language of ωmultisets. It drops the distinction between multiset elements and rewrite rules, and considerably enriches the expressive power of standard multiset rewriting with em...
متن کاملObserving Success in the Pi-Calculus
A contextual semantics – defined in terms of successful termination and mayand shouldconvergence – is analyzed in the synchronous pi-calculus with replication and a constant Stop to denote success. The contextual ordering is analyzed, some nontrivial process equivalences are proved, and proof tools for showing contextual equivalences are provided. Among them are a context lemma and new notions ...
متن کاملContextual Equivalence for the Pi-Calculus that can Stop
The pi-calculus is a well-analyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higher-order concurrent and/or functional programming languages use a contextual semantics observing the termination behavior of programs in all program contexts, traditional program equivalences in the pi-calculus are bisimulations an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 153 شماره
صفحات -
تاریخ انتشار 1993